Minimality Conditions on Πk-Connectedness in Graphs
نویسندگان
چکیده
Let k be a positive integer. A graph G = (V,E) is said to be Πk connected if for any given edge subset F of E(G) with |F | = k, the subgraph induced by F is connected. In this paper, we explore the minimality conditions on Πkconnectedness of a graph and also its properties of prism and corona graphs are obtained.
منابع مشابه
Equivariant weak n-equivalences
The notion of n-type was introduced by J.H.C. Whitehead ([22, 23]) where its clear geometric meaning was presented. Following J.L. Hernandez and T. Porter ([12, 13]) we use the term weak n-equivalence for a map f : X → Y of path-connected spaces which induces isomorphisms πk(f) : πk(X)→ πk(Y ) on homotopy groups for k ≤ n. Certainly, weak n-equivalence of a map determines its n-connectedness bu...
متن کاملNonrepetitive colorings of graphs
A vertex coloring of a graph G is k-nonrepetitive if one cannot find a periodic sequence with k blocks on any simple path of G. The minimum number of colors needed for such coloring is denoted by πk(G). This idea combines graph colorings with Thue sequences introduced at the beginning of 20th century. In particular Thue proved that if G is a simple path of any length greater than 4 then π2(G) =...
متن کاملOn the Connectedness of Clash-free Timetables
We investigate the connectedness of clash-free timetables with respect to the Kempe-exchange operation. This investigation is related to the connectedness of the search space of timetabling problem instances, which is a desirable property, for example for two-step algorithms using the Kempe-exchange during the optimization step. The theoretical framework for our investigations is based on the s...
متن کاملVoxelization in Common Sampling Lattices
In this paper we introduce algorithms to voxelize polygonal meshes in common sampling lattices. In the case of Cartesian lattices, we complete the separability and minimality proof for the voxelization method presented by Huang et al [5]. We extend the ideas to general 2D lattices, including hexagonal lattices, and 3D body-centred cubic lattices. The notion of connectedness in the two lattice s...
متن کاملSome remarks on λp,q-connectedness
A connected graph is λp,q-connected if there is a set of edges whose deletion leaves two components of order at least p and q, respectively. In this paper we present some sufficient conditions for graphs to be λp,q-connected. Furthermore, we study λ2,qconnected graphs in more detail.
متن کامل